Ray Tracing with Selective Visibility
نویسنده
چکیده
We propose a simple yet eeective extension of ray-tracing algorithm that allows selective visibility of objects for speciic rays. Typically, rays are clas-siied as pixel, shadow, reeected and transmitted. We suggest adding a visibility mask to material descriptions , which controls how these rays interact with the material. This addition can be incorporated seamlessly into any ray-tracer and may help to generate visually interesting images.
منابع مشابه
Fast and Accurate Geometric Sound Propagation using Visibility Computations
Geometric Acoustics (GA) techniques based on the image-source method, ray tracing, beam tracing, and ray-frustum tracing, are widely used to compute sound propagation paths. In this paper, we highlight the connection between these propagation techniques with the research on visibility computation in computer graphics and computational geometry. We give a brief overview of visibility algorithms ...
متن کاملInteractive ray tracing with the visibility complex
We describe a method of producing ray-traced images of 2D environments at interactive rates. The 2D environment consists of a set of disjoint, convex polygons. Our technique is based on the visibility complex [17,19] [Pocchiola M, Vegter G. Proc Int J Comput GEOM Applic 1996;6(3):279}308. Rivière S. Visibility computations in 2D polygonal scenes. PhD thesis, Univ. Joseph Fourier, Grenoble I, Fr...
متن کاملAdaptive Quantization Visibility Caching
Ray tracing has become a viable alternative to rasterization for interactive applications and also forms the basis of most global illumination methods. However, even today’s fastest ray-tracers offer only a tight budget of rays per pixel per frame. Rendering performance can be improved by increasing this budget, or by developing methods that use it more efficiently. In this paper we propose a g...
متن کاملProbabilistic visibility evaluation using geometry proxies
Evaluating the visibility between two points is a fundamental problem for ray-tracing and path-tracing algorithms. Ideally, visibility computations are organized such that a minimum number of geometric primitives need to be checked for each ray. Replacing complex geometric shapes by a simpler set of primitives is one strategy to control the amount of intersection calculations. However, approxim...
متن کاملFast Approximate Visibility on the GPU using pre- computed 4D Visibility Fields
We present a novel GPU-based method for accelerating the visibility function computation of the lighting equation in dynamic scenes composed of rigid objects. The method pre-computes, for each object in the scene, the visibility and normal information, as seen from the environment, onto the bounding sphere surrounding the object and encodes it into maps. The visibility function is encoded by a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graphics, GPU, & Game Tools
دوره 1 شماره
صفحات -
تاریخ انتشار 1996